Optimal Open-Loop Control of Vacations, Polling and Service Assignment
نویسندگان
چکیده
We consider in this paper the optimal open-loop control of vacations in queueing systems. The controller has to take actions without state information. We rst consider the case of a single queue, in which the question is when should vacations be taken so as to minimize, in some general sense, workloads and waiting times. We then consider the case of several queues, in which service of one queue constitutes a vacation for others. This is the optimal polling problem. We solve both problems using new techniques from 2, 4] based on multimodularity. Contrrle optimal en boucle ouverte de vacances, polling et de service RRsumm : Dans cet article, nous tudions le contrrle optimal en boucle ouverte des vacances dans un systtme de les d'attente. Le contrrleur doit agir sans information sur l''tat du systtme. Nous considdrons d'abord le cas d'une seule le d'attente, la question tant de ddterminer quand les vacances du serveur doivent tre prises de faaon minimiser, dans un sens ggnnral, la charge et les temps d'attente. Nous considdrons ensuite le cas de plusieurs les, dans lequel un service dans une le constitue une vacance pour toutes les autres. C'est le probllme du polling optimal. Nous rrsolvons les deux probllmes en utilisant de nouvelles techniques prrsenttes dans 2, 4] qui reposent sur la multimodularitt.
منابع مشابه
On the Optimal Open-loop Control Policy for Deterministic and Exponential Polling Systems
In this article, we consider deterministic ~both fluid and discrete! polling systems with N queues with infinite buffers and we show how to compute the best polling sequence ~minimizing the average total workload!+ With two queues, we show that the best polling sequence is always periodic when the system is stable and forms a regular sequence+ The fraction of time spent by the server in the fir...
متن کاملControl of Polling in Presence of Vacations in Heavy Traffic with Applications to Satellite and Mobile Radio Systems
42 7] M. Bramson. State space collapse with application to heavy traac limits for multiclass queueing networks. Optimal and approximately optimal control policies for queues in heavy traac.
متن کاملDiscrete Time Analysis of Multi-Server Queueing System with Multiple Working Vacations and Reneging of Customers
This paper analyzes a discrete-time $Geo/Geo/c$ queueing system with multiple working vacations and reneging in which customers arrive according to a geometric process. As soon as the system gets empty, the servers go to a working vacations all together. The service times during regular busy period, working vacation period and vacation times are assumed to be geometrically distributed. Customer...
متن کاملOn a queueing model with service interruptions
Single-server queues in which the server takes vacations arise naturally as models for a wide range of computer, communication and production systems. In almost all studies on vacation models, the vacation lengths are assumed to be independent of the arrival, service, workload and queue length processes. In the present study we allow the length of a vacation to depend on the length of the previ...
متن کاملBat Algorithm for Optimal Service Parameters in an Impatient Customer N-Policy Vacation Queue
In this paper, a meta-heuristic method, the Bat Algorithm, based on the echolocation behavior of bats is used to determine the optimum service rate of a queue problem. A finite buffer M/M/1 queue with N policy, multiple working vacations and Bernoulli schedule vacation interruption is considered. Under the two customers' impatient situations, balking and reneging, the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Queueing Syst.
دوره 36 شماره
صفحات -
تاریخ انتشار 2000